Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
نویسنده
چکیده
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant’s model. We are given a fixed graph H and want to find all graphs, from some graph class, homomorphic to this H. These graphs will be encoded by a family of polynomials. We give dichotomies for the polynomials for cycles, cliques, trees, outerplanar graphs, planar graphs and graphs of bounded genus (for different definitions of geni). Submitted: March 2015 Reviewed: August 2015 Revised: November 2015 Accepted: November 2015 Final: January 2016 Published: February 2016 Article type: Regular paper Communicated by: M. S. Rahman and E. Tomita This work was first published in WALCOM under [12] E-mail address: [email protected] (Christian Engels) 4 Engels Dichotomy Theorems for . . .
منابع مشابه
On Holant Problems
We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant Problems. Compared to counting Constrained Satisfaction Problems (#CSP), it is a refinement with a more explicit role for the function constraints. Both graph homomorphism and #CSP can be viewed as special cases of Holant Problems. We prove complexity dichotomy theorems in this frame...
متن کاملComputational Complexity of Holant Problems
We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant problems. Compared to counting constraint satisfaction problems (#CSP), it is a refinement with a more explicit role for the constraint functions. Both graph homomorphism and #CSP can be viewed as special cases of Holant problems. We prove complexity dichotomy theorems in this framew...
متن کاملHomomorphism and Sigma Polynomials
By establishing a connection between the sigma polynomial and the homomorphism polynomial, many of the proofs for computing the sigma polynmial are simplified, the homomorphism polynomial can be identified for several new classes of graphs, and progress can be made on identifying homomorphism polynomials.
متن کاملThe complexity of tropical graph homomorphisms
A tropical graph (H, c) consists of a graph H and a (not necessarily proper) vertex-colouring c of H. For a fixed tropical graph (H, c), the decision problem (H, c)-Colouring asks whether a given input tropical graph (G, c1) admits a homomorphism to (H, c), that is, a standard graph homomorphism of G to H that also preserves vertex-colours. We initiate the study of the computational complexity ...
متن کاملEDGE-COLOURED GRAPHS AND SWITCHING WITH Sm, Am AND Dm
We consider homomorphisms and vertex colourings of m-edge-coloured graphs that have a switching operation which permutes the colours of the edges incident with a specified vertex. The permutations considered arise from the action of the symmetric, alternating and dihedral groups on the set of edge colours. In all cases, after studying the equivalence classes of medge-coloured graphs determined ...
متن کامل